Compositions of Top-down Tree Transducers with "-rules
نویسندگان
چکیده
Top-down tree transducers with "-rules ("tdtt) are a restricted version of extended top-down tree transducers. They are implemented in the framework Tiburon and ful ll some criteria desirable in a machine translation model. However, they compute a class of transformations that is not closed under composition (not even for linear and nondeleting "tdtt). A composition construction that composes "tdtt M and N is presented. It is correct whenever (i) M has at most one output symbol in each rule, (ii) M is deterministic or N is linear, and (iii)M is total or N is nondeleting. This corresponds nicely to a classical composition result by Baker.
منابع مشابه
Compositions of Extended Top-down Tree Transducers
Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular loo...
متن کاملComposition Closure of ε-Free Linear Extended Top-Down Tree Transducers
The expressive power of compositions of linear extended topdown tree transducers with and without regular look-ahead is investigated. In particular, the restrictions of ε-freeness, strictness, and nondeletion are considered. The composition hierarchy is finite for all ε-free variants of these transducers except for ε-free nondeleting linear extended top-down tree transducers. The least number o...
متن کاملSurvey: Weighted Extended Top-Down Tree Transducers Part III - Composition
In this survey (functional) compositions of weighted tree transformations computable by weighted extended top-down tree transducers are investigated. The existing results in the literature are explained and illustrated. It is argued, why certain compositions are not possible in the general case, and 3 informed conjectures provide an insight into potentially 3 new composition results that extend...
متن کاملExtended Multi Bottom-Up Tree Transducers Composition and Decomposition
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers, even linear ones, can compute all transformations that are computed by linear extended top-down tree transducers, which are a th...
متن کاملComposition and Decomposition of Extended Multi Bottom-Up Tree Transducers?
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute all transformations that are computed by linear extended top-down tree transducers (which are a theoretical model for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009